#mymoudle.py    函数实现使用递归函数完成斐波那契数列的计算
#0,1,1,2,3,5,8,13,.....
def fibo(n):
    if n == 1:
        return 0
    elif n == 2:
        return 1
    else:
        return fibo(n-1) + fibo(n-2)
def main():
    n = eval(input("请输入一个整数值:"))
    [print(fibo(i), end=" ") for i in range(1,n+1)]
if __name__ == '__main__':
    main()
print()
print("I am mymoudle.py, let's dance!")
